The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Searching for BPA with no syntactic query expansion in all metadata.

Publication years (Num. hits)
1987-1996 (15) 1997-2002 (21) 2003-2006 (20) 2007-2009 (22) 2010-2014 (15) 2015-2021 (16) 2022-2024 (5)
Publication types (Num. hits)
article(34) incollection(1) inproceedings(78) phdthesis(1)
Venues (Conferences, Journals, ...)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 61 occurrences of 46 keywords

Results
Found 114 publication records. Showing 114 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
16Wil M. P. van der Aalst, Arthur H. M. ter Hofstede, Mathias Weske Business Process Management: A Survey. Search on Bibsonomy Business Process Management The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Formal Methods, Workflow Management, Business Process Management
16Jirí Srba Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard. Search on Bibsonomy ICALP The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
16Cornelis M. van Bemmel, Wiro J. Niessen, Onno Wink, Bert Verdonck, Max A. Viergever Blood Pool Agent CE-MRA: Improved Arterial Visualization of the Aortoiliac Vasculature in the Steady-State Using First-Pass Data. Search on Bibsonomy MICCAI The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
16Petr Jancar, Faron Moller Techniques for Decidability and Undecidability of Bisimilarity. Search on Bibsonomy CONCUR The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
16Antonín Kucera 0001, Richard Mayr Weak Bisimilarity with Infinite-State Systems Can Be Decided in Polynomial Time. Search on Bibsonomy CONCUR The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
16Richard Mayr Model Checking PA-Processes. Search on Bibsonomy CONCUR The full citation details ... 1997 DBLP  DOI  BibTeX  RDF PA-processes, model checking, process algebras, tableau systems
16Roland N. Bol, Jan Friso Groote The Meaning of Negative Premises in Transition System Specifications. Search on Bibsonomy J. ACM The full citation details ... 1996 DBLP  DOI  BibTeX  RDF ntyft/ntyxt-format, conservative extension of TSSs, negative premises, priorities and abstraction, logic programming, process algebra, bisimulation, congruence
16D. J. B. Bosscher, W. O. David Griffioen Regularity for a Large Class of Context-Free Processes is Decidable. Search on Bibsonomy ICALP The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
16Olaf Burkart, Didier Caucal, Bernhard Steffen Bisimulation Collapse and the Process Taxonomy. Search on Bibsonomy CONCUR The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
16Alessandro Fantechi, Stefania Gnesi, V. Perticaroli An Expressive Logic for Basic Process Algebra. Search on Bibsonomy MFCS The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
16Hans Hüttel Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes. Search on Bibsonomy CAV The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
16Roland N. Bol, Jan Friso Groote The Meaning of Negative Premises in Transition System Specifications. Search on Bibsonomy ICALP The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
16Jan A. Bergstra ACP with Signals. Search on Bibsonomy ALP The full citation details ... 1988 DBLP  DOI  BibTeX  RDF
16Jan A. Bergstra, Jan Willem Klop ACTtau: A Universal Axiom System for Process Specification. Search on Bibsonomy Algebraic Methods The full citation details ... 1987 DBLP  DOI  BibTeX  RDF 1982 CR Categories F.1.2, F.4.3, D.3.3, F.3.2
Displaying result #101 - #114 of 114 (100 per page; Change: )
Pages: [<<][1][2]
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by L3S.
Previously maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license