Journal of the ACM (JACM)
The Organization of Computations for Uniform Recurrence Equations
Journal of the ACM (JACM)
The Mathematical Theory of Context-Free Languages
The Mathematical Theory of Context-Free Languages
Finite automata and their decision problems
IBM Journal of Research and Development
Parallel program schemata: A mathematical model for parallel computation
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
Static scheduling of synchronous data flow programs for digital signal processing
IEEE Transactions on Computers
Reasoning about systems with many processes
Journal of the ACM (JACM)
Reduction: a new method of proving properties of systems of processes
POPL '75 Proceedings of the 2nd ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Towards a Characterisation of Finite-State Message-Passing Systems
ASIAN '98 Proceedings of the 4th Asian Computing Science Conference on Advances in Computing Science
Cooperative Navigation in Multimedia Systems
EDBT '02 Proceedings of the Worshops XMLDM, MDDE, and YRWS on XML-Based Data Management and Multimedia Engineering-Revised Papers
Parameterized Verification of Multithreaded Software Libraries
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Decidability of Reachability Problems for Classes of Two Counters Automata
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Channel Representations in Protocol Verification
CONCUR '01 Proceedings of the 12th International Conference on Concurrency Theory
Constraint-Based Model Checking for Parameterized Synchronous Systems
FroCoS '02 Proceedings of the 4th International Workshop on Frontiers of Combining Systems
A Behavioral Module System for the Pi-Calculus
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction
CL '00 Proceedings of the First International Conference on Computational Logic
Stubborn Sets for Standard Properties
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Reasoning about Algebraic Generalisation of Petri Nets
Proceedings of the 20th International Conference on Application and Theory of Petri Nets
Constraint-Based Analysis of Broadcast Protocols
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
General decidability theorems for infinite-state systems
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Computing communication cost by Petri nets for hardware/software codesign
RSP '97 Proceedings of the 8th International Workshop on Rapid System Prototyping (RSP '97) Shortening the Path from Specification to Prototype
Alternating two-way AC-tree automata
Information and Computation
Incremental construction of coverability graphs
Information Processing Letters
ReSpecT Nets: Towards an Analysis Methodology for ReSpecT Specifications
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Theory of Universal Speed-Independent Modules
IEEE Transactions on Computers
A Matrix Formalism for Asynchronous Implementation of Algorithms
IEEE Transactions on Computers
An Algorithm for High-Speed Digital Filters
IEEE Transactions on Computers
Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept
IEEE Transactions on Computers
On the Computational Complexity of a Generalized Scheduling Problem
IEEE Transactions on Computers
A Decidable Class of Planar Linear Hybrid Systems
HSCC '08 Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control
Quasi-Static Scheduling of Communicating Tasks
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
Analyzing Reachability for Some Petri Nets With Fast Growing Markings
Electronic Notes in Theoretical Computer Science (ENTCS)
Protocol-Based Web Service Composition
ICSOC '08 Proceedings of the 6th International Conference on Service-Oriented Computing
Data & Knowledge Engineering
Reachability in Timed Counter Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Forward Analysis for WSTS, Part II: Complete WSTS
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Weak Time Petri Nets Strike Back!
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
A Comparison of Some Theoretical Models of Parallel Computation
IEEE Transactions on Computers
A well-structured framework for analysing petri net extensions
Information and Computation
Information Sciences: an International Journal
Journal of Computer and System Sciences
Intercalation lemmas for tree transducer languages
Journal of Computer and System Sciences
A useful device for showing the solvability of some decision problems
Journal of Computer and System Sciences
Proving assertions about parallel programs
Journal of Computer and System Sciences
On program schemata equivalence
Journal of Computer and System Sciences
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
Journal of Computer and System Sciences
A cut-off approach for bounded verification of parameterized systems
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
Computing with energy and chemical reactions
Natural Computing: an international journal
The reachability problem for branching vector addition systems requires doubly-exponential space
Information Processing Letters
Quasi-static scheduling of communicating tasks
Information and Computation
On the computational complexity of dominance links in grammatical formalisms
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Noetherian spaces in verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
The downward-closure of petri net languages
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Rewriting systems for reachability in vector addition systems with pairs
RP'10 Proceedings of the 4th international conference on Reachability problems
Semantic business process engineering
ReasoningWeb'10 Proceedings of the 6th international conference on Semantic technologies for software engineering
Linear time analysis of properties of conflict-free and general Petri nets
Theoretical Computer Science
Expressing properties of resource-bounded systems: the logics RTL* and RTL
CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
Semantic quality attributes for big-step modelling languages
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
Boundedness analysis for open Chemical Reaction Networks with mass-action kinetics
Natural Computing: an international journal
Forward analysis and model checking for trace bounded WSTS
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Minimal coverability set for petri nets: Karp and Miller algorithm with pruning
PETRI NETS'11 Proceedings of the 32nd international conference on Applications and theory of Petri Nets
Model checking coverability graphs of vector addition systems
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Automated error correction of business process models
BPM'11 Proceedings of the 9th international conference on Business process management
Complexity analysis of the backward coverability algorithm for VASS
RP'11 Proceedings of the 5th international conference on Reachability problems
Orion: high-precision methods for static error analysis of c and c++ programs
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Checking system boundedness using ordinary differential equations
Information Sciences: an International Journal
Consistency of user interface based on petri-net
APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Applying step coverability trees to communicating component-based systems
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Partial deduction for linear logic—the symbolic negotiation perspective
DALT'04 Proceedings of the Second international conference on Declarative Agent Languages and Technologies
Petri net reachability checking is polynomial with optimal abstraction hierarchies
SARA'05 Proceedings of the 6th international conference on Abstraction, Reformulation and Approximation
Dynamic cutoff detection in parameterized concurrent programs
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
Prioritized and parallel reactions in shared data space coordination languages
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Decidability of zenoness, syntactic boundedness and token-liveness for dense-timed petri nets
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Alternation in equational tree automata modulo XOR
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Algorithmic verification of asynchronous programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Petri nets with localities and testing
PETRI NETS'10 Proceedings of the 31st international conference on Applications and Theory of Petri Nets
Energy-Based models of p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
Forward analysis of depth-bounded processes
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Behavioural contracts with request-response operations
COORDINATION'10 Proceedings of the 12th international conference on Coordination Models and Languages
Ideal abstractions for well-structured transition systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Step coverability algorithms for communicating systems
Science of Computer Programming
Refinement and asynchronous composition of modal petri nets
Transactions on Petri Nets and Other Models of Concurrency V
Solving coverability problem for monotonic counter systems by supercompilation
PSI'11 Proceedings of the 8th international conference on Perspectives of System Informatics
Levels of Persistency in Place/Transition Nets
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
From Many Places to Few: Automatic Abstraction Refinement for Petri Nets
Fundamenta Informaticae - PETRI NETS 2007
Decidability Problems of a Basic Class of Object Nets
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
The theory of WSTS: the case of complete WSTS
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Old and new algorithms for minimal coverability sets
PETRI NETS'12 Proceedings of the 33rd international conference on Application and Theory of Petri Nets
Distributed Verification with LoLA
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 1
Behavioural contracts with request-response operations
Science of Computer Programming
The covering and boundedness problems for branching vector addition systems
Journal of Computer and System Sciences
Livelock and deadlock detection for PA inter-organizational business processes
EGOVIS'12/EDEM'12 Proceedings of the 2012 Joint international conference on Electronic Government and the Information Systems Perspective and Electronic Democracy, and Proceedings of the 2012 Joint international conference on Advancing Democracy, Government and Governance
Efficient coverability analysis by proof minimization
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Robustness of time petri nets under guard enlargement
RP'12 Proceedings of the 6th international conference on Reachability Problems
On persistent reachability in Petri nets
Information and Computation
On selective unboundedness of VASS
Journal of Computer and System Sciences
Code aware resource management
Formal Methods in System Design
Search and result presentation in scientific workflow repositories
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Analysis of Recursively Parallel Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
Results on equivalence, boundedness, liveness, and covering problems of BPP-Petri nets
PETRI NETS'13 Proceedings of the 34th international conference on Application and Theory of Petri Nets and Concurrency
A relational trace logic for vector addition systems with application to context-freeness
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Expand, enlarge, and check for branching vector addition systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
Presburger Vector Addition Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
On the Context-Freeness Problem for Vector Addition Systems
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
Minimal Coverability Set for Petri Nets: Karp and Miller Algorithm with Pruning
Fundamenta Informaticae - Applications and Theory of Petri Nets and Other Models of Concurrency, 2011
Blending Timed Formal Models with Clock Transition Systems
Fundamenta Informaticae - Dedicated to the Memory of Professor Manfred Kudlek
Old and New Algorithms for Minimal Coverability Sets
Fundamenta Informaticae - Application and Theory of Petri Nets and Concurrency, 2012
| Hi-index | 0.03 |
This paper introduces a model called the parallel program schema for the representation and study of programs containing parallel sequencing. The model is related to Ianov's program schema, but extends it, both by modelling memory structure in more detail and by admitting parallel computation. The emphasis is on decision procedures, both for traditional properties, such as equivalence, and for new properties particular to parallel computation, such as determinacy and boundedness.